Euclidean nature of phylogenetic distance matrices.

نویسندگان

  • Damien M de Vienne
  • Gabriela Aguileta
  • Sébastien Ollier
چکیده

Phylogenies are fundamental to comparative biology as they help to identify independent events on which statistical tests rely. Two groups of phylogenetic comparative methods (PCMs) can be distinguished: those that take phylogenies into account by introducing explicit models of evolution and those that only consider phylogenies as a statistical constraint and aim at partitioning trait values into a phylogenetic component (phylogenetic inertia) and one or multiple specific components related to adaptive evolution. The way phylogenetic information is incorporated into the PCMs depends on the method used. For the first group of methods, phylogenies are converted into variance-covariance matrices of traits following a given model of evolution such as Brownian motion (BM). For the second group of methods, phylogenies are converted into distance matrices that are subsequently transformed into Euclidean distances to perform principal coordinate analyses. Here, we show that simply taking the elementwise square root of a distance matrix extracted from a phylogenetic tree ensures having a Euclidean distance matrix. This is true for any type of distances between species (patristic or nodal) and also for trees harboring multifurcating nodes. Moreover, we illustrate that this simple transformation using the square root imposes less geometric distortion than more complex transformations classically used in the literature such as the Cailliez method. Given the Euclidean nature of the elementwise square root of phylogenetic distance matrices, the positive semidefinitiveness of the phylogenetic variance-covariance matrix of a trait following a BM model, or related models of trait evolution, can be established. In that way, we build a bridge between the two groups of statistical methods widely used in comparative analysis. These results should be of great interest for ecologists and evolutionary biologists performing statistical analyses incorporating phylogenies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical analysis All analyses were conducted on four ultrametric trees (Langley–Fitch and NPRS branch lengths for both the maximum-likelihood and bayesian phylogenies); further analyses

All analyses were conducted on four ultrametric trees (Langley–Fitch and NPRS branch lengths for both the maximum-likelihood and bayesian phylogenies); further analyses were run assuming both a speciational and a gradual mode of character evolution. Results from these analyses were qualitatively nearly identical. To examine whether distances between species in ecological space was related to ph...

متن کامل

Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

متن کامل

Ela Euclidean and Circum-euclidean Distance Matrices: Characterizations and Linear Preservers

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

متن کامل

Ela Block Distance Matrices

In this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by D ij = F ii +F jj −2F ij. When each block in F is 1 × 1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interes...

متن کامل

Block distance matrices

In this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by Dij = Fii+Fjj−2Fij . When each block in F is 1 × 1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interesting ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Systematic biology

دوره 60 6  شماره 

صفحات  -

تاریخ انتشار 2011